Continuous Media Placement and Scheduling in Heterogeneous Disk Storage Systems

نویسنده

  • Roger Zimmermann
چکیده

A number of recent technological trends have made data intensive applications such as continuous media (audio and video) servers a reality. These servers store and retrieve a large volume of data using magnetic disks. Servers consisting of heterogeneous disk drives have become a fact of life for several reasons. First, disks are mechanical devices that might fail. The failed disks are almost always replaced with new models. Second, the current technological trend for these devices is one of annual increase in both performance and storage capacity. Older disk models are discontinued because they cannot compete with the newer ones in the commercial arena. With a heterogeneous disk subsystem, the system should support continuous display while managing resources intelligently in order to maximize their utilization. This dissertation describes a taxonomy of techniques that ensure a continuous display of objects using a heterogeneous disk subsystem. This taxonomy consists of: (a) strategies that partition resources into homogeneous groups of disks and manage each independently, and (b) techniques that treat all disks uniformly, termed non-partitioning techniques. We introduce and evaluate three non-partitioning techniques: Disk Merging, Disk Grouping, and Staggered Grouping. Our results demonstrate that Disk Merging is the most flexible scheme while providing a competitive, low cost per simultaneous display. Finally, using an open simulation model, we compare Disk Merging with a partitioning technique. The obtained results confirm the superiority of Disk Merging.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Load-Balanced Data Placement for Variable-Rate Continuous Media Retrieval

Continuous media storage systems must provide guaranteed services and require large amount of resource consumption in terms of storage capacity and transmission band-width. In this chapter, we focus on a placement scheme for continuous media storage systems in a multimedia database management system to provide the load balance of disks uniformly. In particular, we consider complete control over...

متن کامل

Storage Systems Support for Multimedia Applications

Lately, on-demand streaming multimedia applications have become very popular. Contemporary personal computers can handle the load imposed by such multimedia applications on the client side, but the potentially high number of concurrent users accessing a server represents a generic problem. The multimedia storage system is responsible for storage and retrieval of multimedia data from storage dev...

متن کامل

Disk Scheduling for Variable-Rate Data Streams

We describe three disk scheduling algorithms that can be used in a multimedia server for sustaining a number of heterogeneous variable-rate data streams. A data stream is supported by repeatedly fetching a block of data from the storage device and storing it in a corresponding buffer. For each of the disk scheduling algorithms we give necessary and sufficient conditions for avoiding underand ov...

متن کامل

Cluster Placement: a Data Placement Scheme for a Mass Storage System of Video-on-demand Servers

The retrieval process of a continuous media is considered as a periodic request which each subrequest retrieves a block of data. The next data block has to be ready before the display of the current data block is completed. The size of data block, called buuer size, along with the access time of the data block then determine the number of such requests that can be supported. This implies that t...

متن کامل

Effective Memory Use in a Media Server

A number of techniques have been developed for maximizing disk utilization in media servers, including disk arm scheduling and data placement ones. Instead, in this paper we focus on how to efficiently utilize the available memory. We present techniques for best memory use under different disk policies, and derive precise formulas for computing memory use. We show that with proper memory use, m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998